backward chaining - ορισμός. Τι είναι το backward chaining
Diclib.com
Λεξικό ChatGPT
Εισάγετε μια λέξη ή φράση σε οποιαδήποτε γλώσσα 👆
Γλώσσα:

Μετάφραση και ανάλυση λέξεων από την τεχνητή νοημοσύνη ChatGPT

Σε αυτήν τη σελίδα μπορείτε να λάβετε μια λεπτομερή ανάλυση μιας λέξης ή μιας φράσης, η οποία δημιουργήθηκε χρησιμοποιώντας το ChatGPT, την καλύτερη τεχνολογία τεχνητής νοημοσύνης μέχρι σήμερα:

  • πώς χρησιμοποιείται η λέξη
  • συχνότητα χρήσης
  • χρησιμοποιείται πιο συχνά στον προφορικό ή γραπτό λόγο
  • επιλογές μετάφρασης λέξεων
  • παραδείγματα χρήσης (πολλές φράσεις με μετάφραση)
  • ετυμολογία

Τι (ποιος) είναι backward chaining - ορισμός

METHOD OF FORMING INFERENCES
Working backward from the goal; Backward reasoning; Backwards reasoning; Goal-oriented inference
  • An Example of Backward Chaining.

backward chaining         
<algorithm> An algorithm for proving a goal by recursively breaking it down into sub-goals and trying to prove these until facts are reached. Facts are goals with no sub-goals which are therefore always true. Backward training is the program execution mechanism used by most logic programming language like Prolog. Opposite: forward chaining. (2004-01-26)
Backward chaining         
Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.
Backward chaining (applied behavior analysis)         
TECHNIQUE USED IN APPLIED BEHAVIOR ANALYSIS TO TEACH INDIVIDUALS WITH DEVELOPMENTAL DISABILITIES COMPLEX TASKS BY BREAKING THEM DOWN INTO DISCRETE RESPONSES OR INDIVIDUAL BEHAVIORS
Backward Chaining (Applied Behavior Analysis)
Chaining is a technique used in applied behavior analysis to teach complex tasks by breaking them down into discrete responses or individual behaviors that are part of a task analysis. With a backward chaining procedure the learning can happen in two ways.

Βικιπαίδεια

Backward chaining

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.

In game theory, researchers apply it to (simpler) subgames to find a solution to the game, in a process called backward induction. In chess, it is called retrograde analysis, and it is used to generate table bases for chess endgames for computer chess.

Backward chaining is implemented in logic programming by SLD resolution. Both rules are based on the modus ponens inference rule. It is one of the two most commonly used methods of reasoning with inference rules and logical implications – the other is forward chaining. Backward chaining systems usually employ a depth-first search strategy, e.g. Prolog.